Monotonicity of the order of (D; g)-cagesBALBUENA, C; MARCOTE, X.Applied mathematics letters. 2011, Vol 24, Num 11, pp 1933-1937, issn 0893-9659, 5 p.Article

A note on class one graphs with maximum degree sixXUECHAO LI; RONG LUO; JIANBING NIU et al.Discrete mathematics. 2006, Vol 306, Num 13, pp 1450-1455, issn 0012-365X, 6 p.Article

Non-separating trees in connected graphsDIWAN, Ajit A; THOLIYA, Namrata P.Discrete mathematics. 2009, Vol 309, Num 16, pp 5235-5237, issn 0012-365X, 3 p.Article

On the domination number of Hamiltonian graphs with minimum degree sixXING, Hua-Ming; HATTINGH, Johannes H; PLUMMER, Andrew R et al.Applied mathematics letters. 2008, Vol 21, Num 10, pp 1037-1040, issn 0893-9659, 4 p.Article

On chromatic sums and distributed resource allocationBAR-NOY, A; BELLARE, M; HALLDORSSON, M. M et al.Information and computation (Print). 1998, Vol 140, Num 2, pp 183-202, issn 0890-5401Article

Choosability of the square of planar subcubic graphs with large girthHAVET, F.Discrete mathematics. 2009, Vol 309, Num 11, pp 3553-3563, issn 0012-365X, 11 p.Article

Polynomial-Time Algorithm for Simulation of Weakly Interacting Quantum Spin SystemsBRAVYI, Sergey; DIVINCENZO, David; LOSS, Daniel et al.Communications in mathematical physics. 2008, Vol 284, Num 2, pp 481-507, issn 0010-3616, 27 p.Article

A new degree condition for graphs to have [a, b]-factorJIANXIANG LI.Discrete mathematics. 2005, Vol 290, Num 1, pp 99-103, issn 0012-365X, 5 p.Article

Mathematical theory of truth-valued flow inferenceWANG, P. Z; ZHANG, X. H; LUI, H. C et al.Fuzzy sets and systems. 1995, Vol 72, Num 2, pp 221-238, issn 0165-0114Article

New results for the degree/diameter problemDINNEEN, M. J; HAFNER, P. R.Networks (New York, NY). 1994, Vol 24, Num 7, pp 359-367, issn 0028-3045Article

Some sufficient conditions for a planar graph of maximum degree six to be Class 1YUEHUA BU; WEIFAN WANG.Discrete mathematics. 2006, Vol 306, Num 13, pp 1440-1445, issn 0012-365X, 6 p.Article

New streaming algorithms for counting triangles in graphsJOWHARI, Hossein; GHODSI, Mohammad.Lecture notes in computer science. 2005, pp 710-716, issn 0302-9743, isbn 3-540-28061-8, 7 p.Conference Paper

Chordal topologies for interconnection networksBEIVIDE, Ramon; MARTINEZ, Carmen; IZU, Cruz et al.Lecture notes in computer science. 2003, pp 385-392, issn 0302-9743, isbn 3-540-20359-1, 8 p.Conference Paper

Edge-coloring critical graphs with high degreeMIAO, Lian-Ying; WU, Jian-Liang.Discrete mathematics. 2002, Vol 257, Num 1, pp 169-172, issn 0012-365X, 4 p.Article

On the maximum size of (p, Q)-free familiesFÜREDI, Zoltan; GYARFAS, Andras; RUSZINKO, Miklos et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 385-403, issn 0012-365X, 19 p.Article

Improved non-approximability results for minimum vertex cover with density constraintsCLEMENTI, A. E. F; TREVISAN, L.Theoretical computer science. 1999, Vol 225, Num 1-2, pp 113-128, issn 0304-3975Article

Edge-chromatic critical graphs and the existence of 1-factorsCHOUDUM, S. A.Journal of graph theory. 1993, Vol 17, Num 1, pp 23-29, issn 0364-9024Article

The independence number of graphs in terms of degreesSELKOW, S. M.Discrete mathematics. 1993, Vol 122, Num 1-3, pp 343-348, issn 0012-365XArticle

On the Connectivity of Semiregular CagesBALBUENA, C; GONZALEZ-MORENO, D; MARCOTE, X et al.Networks (New York, NY). 2010, Vol 56, Num 1, pp 81-88, issn 0028-3045, 8 p.Article

A Note on the k-degree Cayley GraphTANAKA, Yuuki; SHIBATA, Yukio.Networks (New York, NY). 2009, Vol 54, Num 1, pp 20-22, issn 0028-3045, 3 p.Article

Diffusion Limited Aggregation on a CylinderBENJAMINI, Itai; YADIN, Ariel.Communications in mathematical physics. 2008, Vol 279, Num 1, pp 187-223, issn 0010-3616, 37 p.Article

Good expander graphs and expander codes: Parameters and decodingJANWA, H.Lecture notes in computer science. 2003, pp 119-128, issn 0302-9743, isbn 3-540-40111-3, 10 p.Conference Paper

Faster fixed parameter tractable algorithms for undirected feedback vertex setRAMAN, Venkatesh; SAURABH, Saket; SUBRAMANIAN, C. R et al.Lecture notes in computer science. 2002, pp 241-248, issn 0302-9743, isbn 3-540-00142-5, 8 p.Conference Paper

Computational complexity of the Krausz dimension of graphsHLINENY, P; KRATOCHVIL, J.Lecture notes in computer science. 1997, pp 214-228, issn 0302-9743, isbn 3-540-63757-5Conference Paper

Approximation and decomposition by extremal graphsMIRONOV, A. A; TSURKOV, V. I.Computational mathematics and mathematical physics. 1993, Vol 33, Num 2, pp 251-262, issn 0965-5425Article